class Solution
{
public:
    int maxTurbulenceSize(vector<int>& arr)
    {
        int n = arr.size();
        vector<int> f(n, 1), g(n, 1);
        if (n == 1) return 1;
        int ret = INT_MIN;
        for (int i = 1; i < n; i++)
        {
            if (arr[i - 1] < arr[i])
            {
                f[i] = g[i - 1] + 1;
            }
            else if (arr[i - 1] > arr[i])
            {
                g[i] = f[i - 1] + 1;
            }
            ret = max(ret, max(f[i], g[i]));
        }
        return ret;
    }
};